Spanning tree - PDFSEARCH.IO - Document Search Engine

Spanning tree
Results: 445

#	Item
111	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
112	Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-13 20:08:15 Graph connectivity Combinatorial optimization Spanning tree NP-complete problems Graph partition Vertex Minimum spanning tree Edge contraction Tree Graph theory Mathematics Theoretical computer science
113	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics
114	6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-11-29 11:50:24 Spanning tree NP-complete problems Operations research Travelling salesman problem Graph operations Minimum spanning tree Graph Planar graph Eulerian path Graph theory Theoretical computer science Mathematics
115	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
116	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:18 Network flow Hamiltonian path Maximum flow problem Ford–Fulkerson algorithm Flow network Tree decomposition Minimum spanning tree Graph theory Mathematics Theoretical computer science
117	M IDTERM S OLUTIONS C OURSE : CPS230 Problem 1: M ODIFIED -D IJKSTRA (G = (V, E), s ∈ V ) Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2009-10-29 19:24:49 Mathematics Minimum spanning tree Theoretical computer science Computational complexity theory Spanning tree
118	CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:43:36 Combinatorial optimization Minimum spanning tree Spanning tree Job shop scheduling Maximum flow problem Max-flow min-cut theorem Cut Connectivity David Shmoys Graph theory Mathematics Theoretical computer science
119	Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2013-06-23 17:01:11 Spanning tree Combinatorial optimization Matching Minimum spanning tree Graph NP-complete problems Graph theory Theoretical computer science Mathematics
120	MapGraph: A High Level API for Fast Development of High Performance Graph Analytics on GPUs ∗ Zhisong Fu Add to Reading List Source URL: www.mapgraph.io Language: English - Date: 2014-12-04 13:31:39 Spanning tree Breadth-first search Neighbourhood Graph coloring Edge coloring GPGPU Graph theory Mathematics Search algorithms

UPDATE